Sensitivity analysis of a fuzzy multiobjective scheduling problem

نویسندگان

  • Sanja Petrovic
  • Carole Fayad
  • Dobrila Petrovic
چکیده

This paper concerns sensitivity analysis of a class of complex job shop scheduling problems which are characterized by: (1) a large number of jobs and machines, (2) uncertain jobs processing times, and (3) multiple measures of schedule performance including average weighted tardiness, the number of tardy jobs, the total setup times, the total idle time of machines, and the total flow times of jobs. The base schedule is generated by applying a new fuzzy multiobjective genetic algorithm which takes into consideration batching of the jobs of a similar type, jobs’ lots sizing and load balancing of the machines. The aim of the proposed sensitivity analysis of a generated schedule is to investigate the consequences of prolongations of job processing times on the measures of schedule performance. The processing times are described by triangular fuzzy numbers and their prolongation is done by expanding the supports of fuzzy numbers. The sensitivity analysis is performed through a series of numerical experiments. The effects of prolongations of job processing times on the measures of performance of a generated schedule are recorded and analysed. It is shown that the sensitivity analysis is among the primaries in evaluating the quality of a generated schedule. The sensitivity analysis is used in identifying the critical jobs and the critical machines which have the properties that the prolongations of their processing times produce the largest deteriorations of the performance measures and the overall quality of a generated schedule.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A multiobjective continuous covering location model

This paper presents a multiobjective continuous covering location problem in fuzzy environment. Because of uncertain covering radius, possibility of covering concept is introduced.Since, the uncertainty may cause risk of uncovering customers; the problemis formulated as a risk management model. The presented model is an extension of the discrete covering location models tocontinuous space. Two ...

متن کامل

Multiobjective security game with fuzzy payoffs

A multiobjective security game problem with fuzzy payoffs is studied in this paper. The problem is formulated as a bilevel programming problem with fuzzy coefficients. Using the idea of nearest interval approximation of fuzzy numbers, the problem is transformed into a bilevel programming problem with interval coefficients. The Karush-Kuhn-Tucker conditions is applied then to reduce the problem ...

متن کامل

FUZZY GOAL PROGRAMMING TECHNIQUE TO SOLVE MULTIOBJECTIVE TRANSPORTATION PROBLEMS WITH SOME NON-LINEAR MEMBERSHIP FUNCTIONS

The linear multiobjective transportation problem is a special type of vector minimum problem in which constraints are all equality type and the objectives are conicting in nature. This paper presents an application of fuzzy goal programming to the linear multiobjective transportation problem. In this paper, we use a special type of nonlinear (hyperbolic and exponential) membership functions to ...

متن کامل

A satisfactory strategy of multiobjective two person matrix games with fuzzy payoffs

The multiobjective two person matrix game problem with fuzzy payoffs is considered in this paper. It is assumed that fuzzy payoffs are triangular fuzzy numbers. The problem is converted to several multiobjective matrix game problems with interval payoffs by using the $alpha$-cuts of fuzzy payoffs. By solving these problems some $alpha$-Pareto optimal strategies with some interval outcomes are o...

متن کامل

Swarm lexicographic goal programming for fuzzy open shop scheduling

In this work we consider a multiobjective open shop scheduling problem with uncertain processing times and flexible due dates, both modelled using fuzzy sets. We adopt a goal programming model based on lexicographic multiobjective optimisation of both makespan and due-date satisfaction and propose a particle swarm algorithm to solve the resulting problem. We present experimental results which s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007